Decentralized list scheduling

Decentralized List Scheduling

Classical list scheduling is a very popular and efficient technique for scheduling jobs for parallel and distributed platforms. It is inherently centralized. However, with the increasing number of processors, the cost for managing a single centralized list becomes too prohibitive. A suitable approach to reduce the contention is to distribute the list among the computational units: each processo...

Speculation and Decentralized Scheduling

As clusters continue to grow in size and complexity, providing scalable and predictable performance is an increasingly important challenge. A crucial roadblock to achieving predictable performance is stragglers, i.e., tasks that take significantly longer than expected to run. At this point, speculative execution has been widely adopted to mitigate the impact of stragglers. However, speculation ...

Decentralized scalable fairshare scheduling

This work addresses Grid fairshare allocation policy enforcement and presents Aequus, a decentralized system for Grid-wide fairshare job prioritization. The main idea of fairshare scheduling is to prioritize users with regard to predefined resource allocation quotas. The presented system builds on three contributions; a flexible tree-based policy model that allows delegation of policy definitio...

List Scheduling and LPT

Decentralized Throughput Scheduling

Motivated by the organization of online service systems, we study models for throughput scheduling in a decentralized setting. In throughput scheduling, we have a set of jobs j with values wj , processing times pj , and release dates rj and deadlines and dj , to be processed nonpreemptively on a set of unrelated machines. The goal is to maximize the total value of jobs scheduled within their ti...